A Complete Characterization of the Gap between Convexity and SOS-Convexity
نویسندگان
چکیده
Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials via the definition of convexity, its first order characterization, and its second order characterization are equivalent. These three equivalent algebraic conditions, henceforth referred to as sos-convexity, can be checked by semidefinite programming whereas deciding convexity is NP-hard. If we denote the set of convex and sosconvex polynomials in n variables of degree d with C̃n,d and Σ̃Cn,d respectively, then our main contribution is to prove that C̃n,d = Σ̃Cn,d if and only if n = 1 or d = 2 or (n, d) = (2, 4). We also present a complete characterization for forms (homogeneous polynomials) except for the case (n, d) = (3, 4) which is joint work with G. Blekherman and is to be published elsewhere. Our result states that the set Cn,d of convex forms in n variables of degree d equals the set ΣCn,d of sos-convex forms if and only if n = 2 or d = 2 or (n, d) = (3, 4). To prove these results, we present in particular explicit examples of polynomials in C̃2,6 \ Σ̃C2,6 and C̃3,4 \ Σ̃C3,4 and forms in C3,6 \ ΣC3,6 and C4,4 \ ΣC4,4, and a general procedure for constructing forms in Cn,d+2 \ ΣCn,d+2 from nonnegative but not sos forms in n variables and degree d. Although for disparate reasons, the remarkable outcome is that convex polynomials (resp. forms) are sos-convex exactly in cases where nonnegative polynomials (resp. forms) are sums of squares, as characterized by Hilbert.
منابع مشابه
Algebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis
The contributions of the first half of this thesis are on the computational and algebraic aspects of convexity in polynomial optimization. We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has been open since 1...
متن کاملCalculating Cost Efficiency with Integer Data in the Absence of Convexity
One of the new topics in DEA is the data with integer values. In DEA classic models, it is assumed that input and output variables have real values. However, in many cases, some inputs or outputs can have integer values. Measuring cost efficiency is another method to evaluate the performance and assess the capabilities of a single decision-making unit for manufacturing current products at a min...
متن کاملA convex polynomial that is not sos-convex
A multivariate polynomial p(x) = p(x1, . . . , xn) is sos-convex if its Hessian H(x) can befactored as H(x) = M (x)M(x) with a possibly nonsquare polynomial matrix M(x). It iseasy to see that sos-convexity is a sufficient condition for convexity of p(x). Moreover, theproblem of deciding sos-convexity of a polynomial can be cast as the feasibility of a semidefiniteprogram, wh...
متن کاملSum of Squares and Polynomial Convexity
The notion of sos-convexity has recently been proposed as a tractable sufficient condition for convexity of polynomials based on sum of squares decomposition. A multivariate polynomial p(x) = p(x1, . . . , xn) is said to be sos-convex if its Hessian H(x) can be factored as H(x) = M (x) M (x) with a possibly nonsquare polynomial matrix M(x). It turns out that one can reduce the problem of decidi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 23 شماره
صفحات -
تاریخ انتشار 2013